Encompassing tests when no model is encompassing

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forecasting combination and encompassing tests

In this paper we demonstrate that forecast encompassing tests are valuable tools in getting an insight into why competing forecasts may be combined to produce a composite forecast which is superior to the individual forecasts. We also argue that results from forecast encompassing tests are potentially useful in model specification. We illustrate this using forecasts of quarterly UK consumption ...

متن کامل

Forecast Encompassing Tests and Probability Forecasts

We consider tests of forecast encompassing for probability forecasts, for both quadratic and logarithmic scoring rules. We propose test statistics for the null of forecast encompassing, present the limiting distributions of the test statistics, and investigate the impact of estimating the forecasting models’ parameters on these distributions. The small-sample performance is investigated, in ter...

متن کامل

Tests of Equal Forecast Accuracy and Encompassing for Nested Models

We examine the asymptotic and finite-sample properties of tests for equal forecast accuracy and encompassing applied to 1-step ahead forecasts from nested parametric models. We first derive the asymptotic distributions of two standard tests and one new test of encompassing. Tables of asymptotically valid critical values are provided. Monte Carlo methods are then used to evaluate the size and po...

متن کامل

Pointed Encompassing Trees

It is shown that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree, that is, a spanning tree on the segment endpoints that contains all input segments, has maximal degree three, and such that every vertex is incident to an angle greater than π. As a consequence, it follows that every set of disjoint line segments has a bounded degree pseudo-trian...

متن کامل

Pointed Binary Encompassing Trees

We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T , that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex v ∈ T is pointed, that is, v has an incident angle greater than π. Such a tree can be completed to a minimum pseudo-triangulation. In particular, it follo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Econometrics

سال: 2001

ISSN: 0304-4076

DOI: 10.1016/s0304-4076(01)00078-1